An Optimal Algorithm for Conflict-Free Coloring for Tree of Rings
نویسنده
چکیده
An optimal algorithm is presented about Conflict-Free Coloring for connected subgraphs of tree of rings. Suppose the number of the rings in the tree is |T| and the maximum length of rings is |R|. A presented algorithm in [1] for a Tree of rings used O(log|T|.log|R|) colors but this algorithm uses O(log|T|+log|R|) colors. The coloring earned by this algorithm has the unique-min property, that is, the unique color is also minimum.
منابع مشابه
Conflict-free Coloring for Connected Subgraphs of Trees and Trees of Rings
We introduce the Connected-Subgraphs Conflict-Free Coloring problem which has applications to frequency assignment in cellular networks: given a graph, assign a minimum number of colors to its vertices in such a way that each connected subgraph contains a vertex with a color that is unique among the colors of all other vertices in that subgraph. We propose an algorithm that achieves an optimal ...
متن کاملConflict-free connection of trees
An edge-colored graph G is conflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required in order to make G conflict-free connected. A coloring of vertices of a hypergraph H = (...
متن کاملPath-related vertex colorings of graphs
We investigate algorithms for a frequency assignment problem in cellular networks. The problem can be modeled as a special coloring problem for graphs. Base stations are the vertices, ranges are the paths in the graph, and colors (frequencies) must be assigned to vertices following the conflict-free property: In every path there is a color that occurs exactly once. We concentrate on the special...
متن کاملOnline conflict-free coloring for geometric hypergraphs
(i) We provide a framework for online conflict-free coloring (CF-coloring) any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring any k-degenerate hypergraph. Our algorithm uses O(k log n) colors with high probability and this bound is asymptotically optimal for any constant k. Moreover, our algorithm uses O(k log k log n) random bits with high ...
متن کاملOnline Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring any k-degenerate hypergraph. Our algorithm uses O(k log n) colors with high probability and this bound is asymptotically optimal for any constant k. Moreover, our algorithm uses O(k log k log n) random bits with high p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1203.2414 شماره
صفحات -
تاریخ انتشار 2012